Distributionally robust expectation inequalities for structured distributions
نویسندگان
چکیده
Quantifying the risk of unfortunate events occurring, despite limited distributional information, is a basic problem underlying many practical questions. Indeed, quantifying constraint violation probabilities in distributionally robust programming or judging the risk of financial positions can both be seen to involve risk quantification, notwithstanding distributional ambiguity. In this work we discuss worst-case probability and conditional valueat-risk (CVaR) problems, where the distributional information is limited to second-order moment information in conjunction with structural information such as unimodality and monotonicity of the distributions involved. We indicate how exact and tractable convex reformulations can be obtained using standard tools from Choquet and duality theory. Our reformulations can be embedded conveniently into higher-level problems such as distributionally robust programs. We make our theoretical results concrete with a stock portfolio pricing problem and an insurance risk aggregation example. Keywords— optimal inequalities, extreme distributions, convex optimisation, CVaR
منابع مشابه
Distributionally Robust Optimization with Infinitely Constrained Ambiguity Sets
We consider a distributionally robust optimization problem where the ambiguity set of probability distributions is characterized by a tractable conic representable support set and expectation constraints. Specifically, we propose and motivate a new class of infinitely constrained ambiguity sets in which the number of expectation constraints could potentially be infinite. We show how the infinit...
متن کاملOptimized Bonferroni Approximations of Distributionally Robust Joint Chance Constraints
A distributionally robust joint chance constraint involves a set of uncertain linear inequalities which can be violated up to a given probability threshold , over a given family of probability distributions of the uncertain parameters. A conservative approximation of a joint chance constraint, often referred to as a Bonferroni approximation, uses the union bound to approximate the joint chance ...
متن کاملTractable Distributionally Robust Optimization with Data
We present a unified and tractable framework for distributionally robust optimization that could encompass a variety of statistical information including, among others things, constraints on expectation, conditional expectation, and disjoint confidence sets with uncertain probabilities defined by φ-divergence. In particular, we also show that the Wasserstein-based ambiguity set has an equivalen...
متن کاملOn the polynomial solvability of distributionally robust k-sum optimization
In this paper, we define a distributionally robust k-sum optimization problem as the problem of finding a solution that minimizes the worst-case expected sum of up to the k largest costs of the elements in the solution. The costs are random with a joint probability distribution that is not completely specified but rather assumed to be known to lie in a set of probability distributions. For k = ...
متن کاملDistributionally Robust Optimization Techniques in Batch Bayesian Optimization
We propose a novel, theoretically-grounded, acquisition function for batch Bayesian optimisation informed by insights from distributionally robust optimization. Our acquisition function is a lower bound on the well-known Expected Improvement function – which requires a multi-dimensional Gaussian Expectation over a piecewise affine function – and is computed by evaluating instead the best-case e...
متن کامل